A Simple Capacity-Achieving Scheme for Channels With Polarization-Dependent Loss
نویسندگان
چکیده
We demonstrate, for a widely used model of channels with polarization dependent loss (PDL), that channel capacity is achieved by simple interference cancellation scheme in conjunction universal precoder. Crucially, the proposed not only information-theoretically optimal, but it also exceptionally and concrete. It transforms PDL into separate scalar additive white Gaussian noise channels, allowing off-the-shelf coding modulation schemes designed such to approach capacity. The signal-to-noise ratio (SNR) penalty incurred under 6 dB reduced information-theoretic minimum mere 1 as opposed 4 SNR naive over-provisioning.
منابع مشابه
Capacity-Achieving Schemes for Finite-State Channels
Capacity-Achieving Schemes for Finite-State Channels
متن کاملA Capacity Achieving and Low Complexity Multilevel Coding Scheme for ISI Channels
We propose a computationally e cient multilevel coding scheme to achieve the capacity of an ISI channel using layers of binary inputs. The transmitter employs multilevel coding with linear mapping. The receiver uses multistage decoding where each stage performs a separate linear minimum mean square error (LMMSE) equalization and decoding. The optimality of the scheme is due to the fact that the...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملChannel Polarization and Polar Codes; Capacity Achieving
A new proposed method for constructing codes that achieves the symmetric capacity (the capacity of the channel with the same probabilities for the inputs), ( ) I W , of any Binary Discrete Memoryless Channel W (B-DMC) will be introduced in this tutorial. This method is based on channel polarization. Channel polarization is the fact that we can synthesize N channels, ( ) { } :1 i N W i N ≤ ≤ , o...
متن کاملOn a simple storage scheme for strings achieving entropy bounds
In this note we propose a storage scheme for a string S[1, n], drawn from an alphabet Σ, that requires space close to the k-th order empirical entropy of S, and allows to retrieve any `-long substring of S in optimal O(1+ ` log|Σ| n ) time. This matches the best known bounds [11, 5], via the use of binary encodings and tables only.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Lightwave Technology
سال: 2023
ISSN: ['0733-8724', '1558-2213']
DOI: https://doi.org/10.1109/jlt.2022.3230266